Segmentation-Based Non-Preemptive Scheduling Algorithms for Optical Burst-Switched Networks
نویسندگان
چکیده
One of the key components in the design of optical burst-switched nodes is the development of channel scheduling algorithms that can efficiently handle data burst contentions. Traditional scheduling techniques use approaches such as wavelength conversion and buffering to resolve burst contention. In this paper, we propose non-preemptive scheduling algorithms that use burst segmentation to resolve contention. We further reduce packet loss by combining burst segmentation and fiber delay lines (FDLs) to resolve contentions during channel scheduling. We propose two types of scheduling algorithms that are classified based on the placement of the FDL buffers in the optical burst-switched node. These algorithms are referred to as delay-first or segment-first algorithms. The scheduling algorithms with burst segmentation and FDLs are investigated through simulation. The simulation results show that the proposed algorithms can effectively reduce the packet loss probability compared to existing scheduling techniques. The delay-first algorithms are suitable for applications which have higher delay tolerance and strict loss constraints, while the segment-first algorithms are suitable for applications with higher loss tolerance and strict delay constraints.
منابع مشابه
Channel scheduling algorithms using burst segmentation and FDLs for optical burst-switched networks
Optical burst switching is a promising solution for terabit transmission of IP data bursts over WDM networks. One of the key components in the design of optical burst-switched nodes is the development of channel scheduling algorithms that can efficiently handle data burst contentions. Currently, traditional scheduling techniques use wavelength conversion and buffering to resolve burst contentio...
متن کاملA Composite Scheduling Approach for Burst Loss Minimization in Optical Burst Switched Networks
In optical burst switched (OBS) networks, burst scheduling is one of the key issue, which affects the performance of networks. Several, scheduling algorithms have been used, such as horizon and void filling based algorithms. Void filling algorithms reduces burst loss, but it has more execution time as compared to horizon algorithms. On the other hand, horizon algorithms has less execution time,...
متن کاملA Photonic Container Switched OBS Architecture with Non- preemptive Centralized Scheduler for the Core Transport Network
We propose a new high-level OBS architecture based on photonic container switching to be deployed in the core network. Our architecture removes most of the complexities of the present day Optical Burst Switching (OBS) technology and makes possible an all-optical core network with zero packet loss guaranteeing equal QoS to all users. In the proposed architecture, the packets are actually packed ...
متن کاملOn Scheduling Problems with Applications to Packet-Switched Optical WDM Networks
We consider a scheduling problem, which we call the Scheduling and Wavelength Assignment (SWA) problem, arising in optical networks that are based on the Wavelength Division Multiplexing (WDM) technology. We prove that the SWA problem is NP-hard for both the preemptive and the non-preemptive cases. Furthermore, we propose two eÆcient approximation algorithms. The rst is for the preemptive case ...
متن کاملProbabilistic Preemptive Scheduling for Service Differentiation in OBS Networks
This paper presents a Probabilistic Preemptive (PP) scheduling discipline for service differentiation in Optical Burst Switching (OBS) networks. The main idea of PP is that a probabilistic parameter is added to the preemptive scheduling discipline. With PP, a high priority burst preempts a low priority burst in a probabilistic manner. By changing the probabilistic parameter, PP can achieve flex...
متن کامل